Quantifying edge significance on maintaining global connectivity

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantifying edge significance on maintaining global connectivity

Global connectivity is a quite important issue for networks. The failures of some key edges may lead to breakdown of the whole system. How to find them will provide a better understanding on system robustness. Based on topological information, we propose an approach named LE (link entropy) to quantify the edge significance on maintaining global connectivity. Then we compare the LE with the othe...

متن کامل

Global Edge Connectivity in Dynamic Graphs

We survey results related to the data structures for dynamic graphs which can maintain global edge connectivity. We explain the major techniques used in these data structures and explore in detail the algorithm by Thorup for polylogarithmic edge-connectivity.

متن کامل

On the edge-connectivity of C_4-free graphs

Let $G$ be a connected graph of order $n$ and minimum degree $delta(G)$.The edge-connectivity $lambda(G)$ of $G$ is the minimum numberof edges whose removal renders $G$ disconnected. It is well-known that$lambda(G) leq delta(G)$,and if $lambda(G)=delta(G)$, then$G$ is said to be maximally edge-connected. A classical resultby Chartrand gives the sufficient condition $delta(G) geq frac{n-1}{2}$fo...

متن کامل

Quantifying the conservation value of seascape connectivity: a global synthesis

Australian Rivers Institute – Coast and Estuaries, and School of Environment, Griffith University, Gold Coast, Qld 4222, Australia, School of Science and Engineering, University of the Sunshine Coast, Maroochydore, Qld 4558, Australia, Biogeography Branch, National Oceanic and Atmospheric Administration, Silver Spring, MD 20910, USA, Marine Institute, Plymouth University, Plymouth PL4 8AA, UK, ...

متن کامل

Maintaining Global Assertions on DistributedSystems

This paper develops a method for maintaining global assertions on a network of distributed processes. The global assertion has the form (X i is a variable which is local to one process in a distributed system and K is a constant. It is assumed that the initial values of all local variables are known and that the global assertion initially holds. This form is more general than the summation form...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scientific Reports

سال: 2017

ISSN: 2045-2322

DOI: 10.1038/srep45380